By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 35, Issue 5, pp. 1007-1281

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Function Matching

Amihood Amir, Yonatan Aumann, Moshe Lewenstein, and Ely Porat

pp. 1007-1022

BibTeX  Abstract Full Text:  PDF

Finding Four Independent Trees

Sean Curran, Orlando Lee, and Xingxing Yu

pp. 1023-1058

BibTeX  Abstract Full Text:  PDF

Efficient Simulations by Queue Machines

Holger Petersen and John Michael Robson

pp. 1059-1069

BibTeX  Abstract Full Text:  PDF

The Complexity of the Local Hamiltonian Problem

Julia Kempe, Alexei Kitaev, and Oded Regev

pp. 1070-1097

BibTeX  Abstract Full Text:  PDF

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network

Jesper Jansson, Nguyen Bao Nguyen, and Wing-Kin Sung

pp. 1098-1121

BibTeX  Abstract Full Text:  PDF

Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs

Karl-Heinz Niggl and Henning Wunderlich

pp. 1122-1147

BibTeX  Abstract Full Text:  PDF

Fast Construction of Nets in Low-Dimensional Metrics and Their Applications

Sariel Har-Peled and Manor Mendel

pp. 1148-1184

BibTeX  Abstract Full Text:  PDF

Extracting Randomness via Repeated Condensing

Omer Reingold, Ronen Shaltiel, and Avi Wigderson

pp. 1185-1209

BibTeX  Abstract Full Text:  PDF

Word Problems and Membership Problems on Compressed Words

Markus Lohrey

pp. 1210-1240

BibTeX  Abstract Full Text:  PDF

Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems

Maurice Queyranne and Andreas S. Schulz

pp. 1241-1253

BibTeX  Abstract Full Text:  PDF

Oblivious Polynomial Evaluation

Moni Naor and Benny Pinkas

pp. 1254-1281

BibTeX  Abstract Full Text:  PDF